Hybrid Deterministic-Stochastic Methods for Data Fitting
نویسندگان
چکیده
منابع مشابه
Hybrid Deterministic-Stochastic Methods for Data Fitting
Many structured data-fitting applications require the solution of an optimization problem involving a sum over a potentially large number of measurements. Incremental gradient algorithms offer inexpensive iterations by sampling a subset of the terms in the sum; these methods can make great progress initially, but often slow as they approach a solution. In contrast, full-gradient methods achieve...
متن کاملErratum: Hybrid Deterministic-Stochastic Methods for Data Fitting
∗Submitted to the journal’s Computational Methods in Science and Engineering section February 1, 2013; accepted for publication March 25, 2013; published electronically August 30, 2013. http://www.siam.org/journals/sisc/35-4/90825.html †Department of Computer Science, University of British Columbia, Vancouver V6T 1Z4, BC, Canada ([email protected]). ‡INRIA-SIERRA team, Laboratoire d’Informatique de...
متن کاملDeterministic Approximate Methods for Maximum Consensus Robust Fitting
Maximum consensus estimation plays a critically important role in robust fitting problems in computer vision. Currently, the most prevalent algorithms for consensus maximization draw from the class of randomized hypothesize-and-verify algorithms, which are cheap but can usually deliver only rough approximate solutions. On the other extreme, there are exact algorithms which are exhaustive search...
متن کاملSuperpixel-Based Two-View Deterministic Fitting for Multiple-Structure Data
This paper proposes a two-view deterministic geometric model fitting method, termed Superpixel-based Deterministic Fitting (SDF), for multiplestructure data. SDF starts from superpixel segmentation, which effectively captures prior information of feature appearances. The feature appearances are beneficial to reduce the computational complexity for deterministic fitting methods. SDF also include...
متن کاملHybrid Methods for Resource Allocation and Scheduling Problems in Deterministic and Stochastic Environments
This work presents exact, hybrid algorithms for mixed resource Allocation and Scheduling problems; in general terms, those consist into assigning over time finite capacity resources to a set of precedence connected activities. The proposed methods have broad applicability, but are mainly motivated by applications in the field of Embedded System Design. In particular, highperformance embedded co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2012
ISSN: 1064-8275,1095-7197
DOI: 10.1137/110830629